Diameters of Connected Components of Commuting Graphs

نویسندگان

  • DAVID DOLŽAN
  • D. Dolžan
  • M. Konvalinka
  • P. Oblak
چکیده

In this paper, we calculate diameters of connected components of commuting graphs of GLn(S), for an integer n ≥ 2 and a commutative antinegative entire semiring S, unless n is a non-prime odd number and S has at least two invertible elements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diameters of conneted components of commuting graphs

In this paper, diameters of connected components of commuting graphs of GLn(S) are calculated, for an integer n ≥ 2 and a commutative antinegative entire semiring S, unless n is a non-prime odd number and S has at least two invertible elements.

متن کامل

On the commuting graph of some non-commutative rings with unity

‎‎Let $R$ be a non-commutative ring with unity‎. ‎The commuting graph‎ of $R$ denoted by $Gamma(R)$‎, ‎is a graph with a vertex set‎ ‎$Rsetminus Z(R)$ and two vertices $a$ and $b$ are adjacent if and only if‎ $ab=ba$‎. ‎In this paper‎, ‎we investigate non-commutative rings with unity of order $p^n$ where $p$ is prime and $n in lbrace 4,5 rbrace$‎. It is shown that‎, ‎$Gamma(R)$ is the disjoint ...

متن کامل

On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices

We present a two-parameter family (Gm,k)m,k∈N≥2 , of finite, non-abelian random groups and propose that, for each fixed k, as m → ∞ the commuting graph of Gm,k is almost surely connected and of diameter k. We present heuristic arguments in favour of this conjecture, following the lines of classical arguments for the Erdős– Rényi random graph. As well as being of independent interest, our groups...

متن کامل

The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m

The commuting graph of a group G, denoted by Γ(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Zm be the commutative ring of equivalence classes of integers modulo m. In this paper we investigate the connectivity and diameters of the commuting graphs of GL(n,Zm) to contribute to the conje...

متن کامل

A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS

The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013